Minimum color spanning circle of imprecise points
نویسندگان
چکیده
• The smallest minimum color-spanning circle (S-MCSC) problem can be solved in O ( n k log ) time. largest (L-MCSC) is NP-Hard. A 1 3 -factor 2 , if no two distinct color disks intersect) approximation to the L-MCSC computed Let R a set of colored imprecise points, where each point by one colors. Each specified unit disk which lies. We study computing and possible spanning circle, among all choices points inside their corresponding disks. present an time algorithm compute circle. Regarding we show that NP - Hard algorithm. improve factor for case intersect.
منابع مشابه
Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle
Given a set of n colored points with a total of m > 3 colors in 2D, the problem of identifying the smallest color-spanning object is studied. We have considered two different shapes: (i) corridor, and (ii) rectangle of arbitrary orientation. Our proposed algorithm identifies the narrowest color-spanning corridor in O(n2 log n) time using O(n) space. Our proposed algorithm for identifying minimu...
متن کاملComputing Minimum Diameter Color-Spanning Sets
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial time for L1 and L∞ metrics, while it is NP-hard for all other Lp metrics even in two dimensions. However, we can efficiently compute a constant factor approximation.
متن کاملMinimum separating circle for bichromatic points by linear programming
Consider two point sets in the plane, a red set and a blue set. We show how to find the smallest circle that encloses all red points and as few blue points as possible in its interior, using linear programming with violations.
متن کاملA Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle
Consider a set of n points in the plane, each one of which is colored either red, blue, or purple. A red-blue-purple spanning graph (RBP spanning graph) is a graph whose vertices are the points and whose edges connect the points such that the subgraph induced by the red and purple points is connected, and the subgraph induced by the blue and purple points is connected. The minimum RBP spanning ...
متن کاملSeparability of Imprecise Points
An imprecise point is a point p with an associated imprecision region Ip indicating the set of possible locations of the point p. We study separability problems for a set R of red imprecise points and a set B of blue imprecise points in R, where the imprecision regions are axis-aligned rectangles and each point p ∈ R∪B is drawn uniformly at random from Ip. Our results include algorithms for fin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2022
ISSN: ['1879-2294', '0304-3975']
DOI: https://doi.org/10.1016/j.tcs.2022.07.016